Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order
نویسندگان
چکیده
We compare Aut(Q), the classical automorphism group of a countable dense linear order, with Autc(Q), the group of all computable automorphisms of such an order. They have a number of similarities, including the facts that every element of each group is a commutator and each group has exactly three nontrivial normal subgroups. However, the standard proofs of these facts in Aut(Q) do not work for Autc(Q). Also, Aut(Q) has three fundamental properties which fail in Autc(Q): it is divisible, every element is a commutator of itself with some other element, and two elements are conjugate if and only if they have isomorphic orbital structures.
منابع مشابه
OD-characterization of $U_3(9)$ and its group of automorphisms
Let $L = U_3(9)$ be the simple projective unitary group in dimension 3 over a field with 92 elements. In this article, we classify groups with the same order and degree pattern as an almost simple group related to $L$. Since $Aut(L)equiv Z_4$ hence almost simple groups related to $L$ are $L$, $L : 2$ or $L : 4$. In fact, we prove that $L$, $L : 2$ and $L : 4$ are OD-characterizable.
متن کاملThe algebraic structure of the isomorphic types of tally, polynomial time computable sets
We investigate the polynomial time isomorphic type structure of PT ⊂ {A : A ⊆ {0}∗} (the class of tally, polynomial time computable sets). We partition PT into six parts: D−, D̂−, C, S, F, F̂ , and study their p-isomorphic properties separately. The structures of 〈deg1(F ); ≤〉, 〈deg1(F̂ ); ≤〉, and 〈deg1(C); ≤〉 are obvious, where F , F̂ , and C are the class of tally finite sets, the class of tally ...
متن کاملNotes from Hausdorff Institute Talk Oct 10, 2013
(a) isomorphism ∼=, elementary equivalence ≡, elementary equivalence ≡α for Lω1,ω sentences of rank < α. (b) Isomorphism of countable graphs, linear orders, countable Boolean algebras is ≤B complete for orbit equivalence relations of continuous S∞ actions (≤B is Borel reducibility, S∞ is the Polish group of permutations of ω). (c) for ∼= is partially answered in computable model theory, with no...
متن کاملOD-characterization of $S_4(4)$ and its group of automorphisms
Let $G$ be a finite group and $pi(G)$ be the set of all prime divisors of $|G|$. The prime graph of $G$ is a simple graph $Gamma(G)$ with vertex set $pi(G)$ and two distinct vertices $p$ and $q$ in $pi(G)$ are adjacent by an edge if an only if $G$ has an element of order $pq$. In this case, we write $psim q$. Let $|G= p_1^{alpha_1}cdot p_2^{alpha_2}cdots p_k^{alpha_k}$, where $p_1
متن کاملTHE ORDER GRAPHS OF GROUPS
Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 19 شماره
صفحات -
تاریخ انتشار 2002